Proceedings of the 26th International Conference on Data Engineering

Adaptive query scheduling for mixed database workloads with multiple objectives.

Managing Dynamic Mixed Workloads for Operational Business Intelligence.
Abstract. As data warehousing technology gains a ubiquitous presence in business today, companies are becoming increasingly reliant upon the information contained in their data warehouses to inform their operational decisions. This information, known as business intelligence (BI), traditionally has taken the form of nightly or monthly reports and batched analytical queries that are run at specific times of day. However, as the time needed for data to migrate into data warehouses has decreased, and as the amount of data stored has increased, business intelligence has come to include metrics, streaming analysis, and reports with expected delivery times that are measured in hours, minutes, or seconds. The challenge is that in order to meet the necessary response times for these operational business intelligence queries, a given warehouse must be able to support at any given time multiple types of queries, possibly with different sets of performance objectives for each type. In this paper, we discuss why these dynamic mixed workloads make workload management for operational business intelligence (BI) databases so challenging, review current and proposed attempts to address these challenges, and describe our own approach. We have carried out an extensive set of experiments, and report on a few of our results. 1
Information Extraction
The Internet presents numerous sources of useful information---telephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user&#039;s behalf. However, these resources are usually formatted for use by people (e.g., the relevant content is embedded in HTML pages), so extracting their content is difficult. Wrappers are often used for this purpose. A wrapper is a procedure for extracting a particular resource&#039;s content. Unfortunately, hand-coding wrappers is tedious. We introduce wrapper induction, a technique for automatically constructing wrappers. Our techniques can be described in terms of three main contributions. First, we pose the problem of wrapper construction as one of inductive learn...
Leveraging web streams for contractual situational awareness in operational BI.

Leveraging Business Process Models for ETL Design.

Leveraging Business Process Models for ETL Design.

Live Business Intelligence for the Real%2DTime Enterprise.

Data desensitization of customer data for use in optimizer performance experiments.

Optimizing ETL workflows for fault%2Dtolerance.

Partitioning real%2Dtime ETL workflows.

Visual analytics of large multidimensional data using variable binned scatter plots.

Application of Visual Analytics for Thermal State Management in Large Data Centres.

Special issue on conceptual modeling %2D 28th International Conference on Conceptual Modeling %28ER 2009%29.

Variable binned scatter plots.

Generalized scatter plots.
One of the most effective ways for a dolphin to perceive its environment for the purpose of
Business Process Management
Business Process Management (BPM) includes methods, techniques,  and tools to support the design, enactment, management, and  analysis of operational business processes. It can be considered as an  extension of classical Workflow Management (WFM) systems and approaches.
Conceptual Modeling %2D ER 2009
I believe in rigorous research conducted on relevant topics, to promote organizational as well as individual progression to a better future. My personal aspiration is to achieve excellence on all levels of life, be it on a personal level or regarding research, teaching and service work. Dr Jan Christof Recker PROFESSIONAL FOCUS Research My research interests are primarily in the area of Business Process Design, an important organizational practice to achieve operational excellence, process efficiency or business innovation. Business process design encompasses a variety of tools, methods, management practices and skills for the development of new or improved blueprints of business processes. I have won several awards for my research in this area. I am mostly recognized through my work around the process design standard BPMN, and its adoption in industry practice. My current research streams encompass the following areas:
A Collaboration and Productiveness Analysis of the BPM Community.

CHAOS A Data Stream Analysis Architecture for Enterprise Applications.

Data integration flows for business intelligence.

Managing long%2Drunning queries.
Exceptionally large amounts of both distributed data and computational resources are becoming available through the Grid. This will enable efficient exchange and processing of very large amounts of data combined with CPU intensive computations, as required by many scientific applications. We propose a customizable Grid-based query processor built on top of an established Grid infrastructure, NorduGrid. It allows users to submit queries wrapping user-defined long running operations that filter and transform distributed customized data. Limitations imposed by the used Grid infrastructure influence the architecture. For example, resource requirements have to be specified before Grid jobs are started and delays may occur based on the availability of required resources for a job. We are developing a fully functional prototype to investigate the viability of the approach and its applicability. Our first application area is Particle Physics where scientists analyze huge amount of data produced by a collider or simulators to identify particles. 
Fair

rFEED A Mixed Workload Scheduler for Enterprise Data Warehouses.

QuickStart An Upfront Client%2DBased Design Advisor for Parallel Data Warehouses.

Predicting Multiple Metrics for Queries Better Decisions Enabled by Machine Learning.
Abstract — One of the most challenging aspects of managing a very large data warehouse is identifying how queries will behave before they start executing. Yet knowing their performance characteristics — their runtimes and resource usage — can solve two important problems. First, every database vendor struggles with managing unexpectedly long-running queries. When these long-running queries can be identified before they start, they can be rejected or scheduled when they will not cause extreme resource contention for the other queries in the system. Second, deciding whether a system can complete a given workload in a given time period (or a bigger system is necessary) depends on knowing the resource requirements of the queries in that workload. We have developed a system that uses machine learning to accurately predict the performance metrics of database queries whose execution times range from milliseconds to hours. For training and testing our system, we used both real customer queries and queries generated from an extended set of TPC-DS templates. The extensions mimic queries that caused customer problems. We used these queries to compare how accurately different techniques predict metrics such as elapsed time, records used, disk I/Os, and message bytes. The most promising technique was not only the most accurate, but also predicted these metrics simultaneously and using only information available prior to query execution. We validated the accuracy of this machine learning technique on a number of HP Neoview configurations. We were able to predict individual query elapsed time within 20 % of its actual time for 85 % of the test queries. Most importantly, we were able to correctly identify both the short and long-running (up to two hour) queries to inform workload management and capacity planning. I.
QoX%2Ddriven ETL design reducing the cost of ETL consulting engagements.

Classification with Unknown Classes.
In recent years, we have seen remarkable advances in algorithms for relational learning, especially statistically based algorithms. These algorithms have been developed in a wide variety of different research fields and problem settings. It is important scientifically to understand the strengths, weaknesses, and applicability of the various methods. However, we are stymied by a lack of a common framework for characterizing relational learning. What are the dimensions along which relational learning problems and potential solutions should be characterized? Jensen (1998) outlined dimensions that are applicable to relational learning, including various measures of size, interconnectivity and variety; items to be characterized include the data, the (true) model, the background knowledge, and so on. Additionally, individual research papers will characterize aspects of relational learning that they are considering and are ignoring. However, there are few studies or even position papers that examine various methods, contrasting them along common dimensions (one notable exception being the paper by Jensen and Neville (2002b)). It also is not clear whether straightforward measures of size, interconnectivity, or variety will be the best dimensions. In this paper we argue that other sorts of dimensions are at least as important. In particular, the aforementioned dimensions characterize the learning problem (i.e., the training data and the true model). Equally important are characteristics of the context for using the learned model—which have important implications for learning. For illustration, let us discuss three context characteristics, and their implications for studying relational learning algorithms.
Benchmarking ETL Workflows.
Extraction–Transform–Load (ETL) processes comprise complex data workflows, which are responsible for the maintenance of a Data Warehouse. Their practical importance is denoted by the fact that a plethora of ETL tools currently constitutes a multi-million dollars market. However, each one of them follows a different design and modeling technique and internal language. So far, the research community has not agreed upon the basic characteristics of ETL tools. Hence, there is a necessity for a unified way to assess ETL workflows. In this paper, we investigate the main characteristics and peculiarities of ETL processes and we propose a principled organization of test suites for the problem of experimenting with ETL scenarios. 1.
Visual analytics of anomaly detection in large data streams.

Business Processes Meet Operational Business Intelligence.
As Business Intelligence architectures evolve from off-line strategic decision-making to on-line operational decision-making, the design of the backend Extract-Transform-Load (ETL) processes is becoming even more complex. We describe the challenges in ETL design and implementation, and the approach we are taking to meet these challenges. Our approach is centered around a layered methodology that starts with modeling the business processes of the enterprise, and their information requirements and service level objectives, and proceeds systematically through logical design to physical implementation. A key element of this approach is the explicit specification of a variety of quality objectives (we call these collectively the QoX objectives) at the business level, and the use of these objectives to drive the optimization of the design at the logical and physical levels. 1
Managing operational business intelligence workloads.

A Testbed for Managing Dynamic Mixed Workloads.
Workload management for operational business intelligence (BI) databases is difficult. Queries vary widely in length and objectives. Resource contention is difficult to predict and to control as dynamically-arriving, long, analyst queries compete for resources with ongoing online-transaction processing (OLTP) queries and batch report queries. Currently, administrators struggle to choose workload management policies and set their thresholds manually. The goal of our project is a software framework to make the management of such mixed workloads easier. Our framework includes a policy controller that tunes workload management policies automatically to meet workload objectives. This demonstration of our system illustrates (1) the difficulty of managing a BI database workload and (2) the benefits of tuning policies automatically and individually for each service class of queries in a workload. In addition, our demonstrator is a useful research tool for understanding how policies and a policy controller adapt as the system state changes under a mixed workload. In our demo, the participant plays the administrator and tunes the policies for a variety of difficult-to-manage workloads as they execute. These policies include admission control, scheduling, and execution control policies. We visualize the policies, the user objectives, and the load on the system components (CPUs, memory, disks) during execution, which helps the participant see whether objectives are being met and make appropriate policy decisions. At the end of each workload, the participant is given the opportunity to compare how their policies met workload objectives versus policies determined by our automatic policy controller. 1.
BI batch manager a system for managing batch workloads on enterprise data%2Dwarehouses.

PQR Predicting Query Execution Times for Autonomous Workload Management.

Collaborative Business Intelligence Enabling Collaborative Decision Making in Enterprises.


Density Displays for Data Stream Monitoring.

Automatic Workload Management for Enterprise Data Warehouses.


Guest Editors%27 message.

Business Intelligence for the Real%2DTime Enterprises
Abstract. Next Generation Enterprises (NGEs) rely on automation, mobility, real-time business activity monitoring, agility, and self-service over widely distributed operations to conduct business. It is important to study and analyze such enterprises because they will drive the future industry and job markets. This paper gives a quick overview of NGEs and proposes a conceptual framework for analyzing the IT infrastructure needed to support the NGEs. A systematic discussion and analysis of key building blocks, their interrelationships, and main trends is presented with an emphasis on monitoring and split-second reaction times needed across widely distributed business units of such enterprises.
Multi%2DResolution Techniques for Visual Exploration of Large Time%2DSeries Data.

Abstract Process Data Warehousing.

Dynamic Workload Management for Very Large Data Warehouses Juggling Feathers and Bowling Balls.
Workload management for business intelligence (BI) queries poses different challenges than those addressed in the online transaction processing (OLTP) context. The fundamental problem is that the execution times of BI queries can range from milliseconds to hours, and it is difficult to estimate these times accurately. Key challenges raised by this problem are how to identify queries that are not performing properly and what to do about them. We propose here a workload management system for controlling the execution of individual queries based on realistic customer service level objectives. In order to validate our proposal, we have implemented an experimental system that includes a dynamic execution controller that leverages fuzzy logic. We present results from a number of experiments that we ran using workloads based on actual industrial workloads and customer objectives that we gathered by interviewing industry practitioners. Our experiments show that even a handful of moderately mis-behaving problem queries can have a significant impact on a workload consisting of thousands of queries. We were surprised when our experiments also demonstrated that false positives – incorrectly identifying a normal query as a problem – can also have significant consequences. For those reasons, it is very important that an execution controller be as accurate as possible – avoiding both false positives and false negatives. Our experiments also validate that our execution controller can markedly improve the execution of a workload that includes problem queries. 1.
A Generic solution for Warehousing Business Process Data.
Improving business processes is critical to any corporation. Process improvement requires analysis as its first basic step. Process analysis has many unique challenges: i) companies execute many business processes, and devising ad hoc solutions for each of them is too costly. Hence, generic approaches must be sought; ii) the abstraction level at which processes need to be analyzed is much higher with respect to the information available in the process execution environment; iii) the rapidly increasing need of codeveloping the process analysis and the process automation solution and the scale of the problem makes it hard to cope with frequent changes in the sources of process data. To address these problems, we have developed a process warehousing solution, used by HP and its customers. In this paper we describe the solution, the challenges we had to face, and the lessons we learned in implementing and deploying it.
Value%2DCell Bar Charts for Visualizing Large Transaction Data Sets.

Improving process models by discovering decision points.

Proceedings of the 32nd International Conference on Very Large Data Bases

A Metric Definition
Abstract. Measuring is a central task in the any engineering discipline, and modelling is not an exception. The need for measuring properties over i* models arises in different contexts. We have analysed this need over i * models of organizations, projects, systems and architectures. As a result, we have proposed a framework which includes: (a) a metamodel of i * that defines the elements that build the model; (b) a framework for the definition of metrics; (c) a collection of metrics (currently under construction) of different nature built with the framework. In this work, we present these basic concepts and discuss the applicability of the approach. 1
Enabling Outsourced Service Providers to Think Globally While Acting Locally.

Business process impact visualization and anomaly detection.
Business operations involve many factors and relationships and are modeled as complex business process workflows. The execution of these business processes generates vast volumes of complex data. The operational data are instances of the process flow, taking different paths through the process. The goal is to use the complex information to analyze and improve operations and to optimize the process flow. In this paper, we introduce a new visualization technique, called VisImpact that turns raw operational business data into valuable information. VisImpact reduces data complexity by analyzing operational data and abstracting the most critical factors, called impact factors, which influence business operations. The analysis may identify single nodes of the business flow graph as important factors but it may also determine aggregations of nodes to be important. Moreover, the analysis may find that single nodes have certain data values associated with them which have an influence on some business metrics or resource usage parameters. The impact factors are presented
Technologies for E%2DServices
Abstract. The connectivity generated by the Internet is opening unprecedented opportunities of automating business-to-business collaborations. As a result, organisations of all sizes are forming online alliances in order to deliver integrated value-added services. Unfortunately, due to a lack of tools and methodologies offering an adequate level of abstraction, the development of these integrated services is currently ad hoc and requires a considerable effort of low-level programming, especially when dealing with coordination, communication, and execution tracing issues. In this paper, we present a framework through which business services can be declaratively composed, and the resulting composite services can be executed in a fully traceable manner. The traces of a composite service executions are collected incrementally through peer-to-peer interactions between the involved providers. Once collected, these traces are stored as linked objects in distributed repositories, which are made available for auditing, customer feedback and quality assessment. 1
Predictive Business Operations Management.

VisBiz A Business Process Visualization Case Study.

iBOM A Platform for Intelligent Business Operation Management.

Challenges in Business Process Analysis and Optimization.

Importance%2DDriven Visualization Layouts for Large Time Series Data.
Time series are an important type of data with applications in virtually every aspect of the real world. Often a large number of time series have to be monitored and analyzed in parallel. Sets of time series may show intrinsic hierarchical relationships and varying degrees of importance among the individual time series. Effective techniques for visually analyzing large sets of time series should encode the relative importance and hierarchical ordering of the time series data by size and position, and should also provide a high degree of regularity in order to support comparability by the analyst. In this paper, we present a framework for visualizing large sets of time series. Based on the notion of inter time series importance relationships, we define a set of objective functions that space-filling layout schemes for time series data should obey. We develop an efficient algorithm addressing the identified problems by generating layouts that reflect hierarchyand importance-based relationships in a regular layout with favorable aspect ratios. We apply our technique to a number of real-world data sets including sales and stock data, and we compare our technique with an aspect ratio aware variant of the well-known TreeMap algorithm. The examples show the advantages and practical usefulness of our layout algorithm.
Business Process Optimization.
Abstract: Several factors may force enterprises to modify their business processes: they are threatened by competition; they need to develop new process solutions to fulfil customer needs; they have to react to organizational change; and more. In order to efficiently change business processes, reference models as sources of to-be business processes that are to bring about economic improvements can be used. While in the past the application of reference process models would merely provide a new process model without addressing the necessary efforts of changing the technical solutions beneath it, the concept of service-oriented architecture (SOA) may significantly reduce these efforts by aligning services to business activities. The presumed ease of readily deployable business processes will then strongly promote the increased use of reference process models in business process optimization. In order to gain more insights into the potential of using reference processes in an SOA environment we carried out an analysis of a business process improvement scenario. We classified the modification operations of implementing reference processes in the scenario and propose an evaluation method for the implementation effort based on a cost model. 1
Challenges in Business Process Analysis and Optimization.

Proceedings of the Fourth SIAM International Conference on Data Mining

Managing the Intelligent Enterprise.
No nursing home here!!! 2
Business Process Optimization.
Abstract: Several factors may force enterprises to modify their business processes: they are threatened by competition; they need to develop new process solutions to fulfil customer needs; they have to react to organizational change; and more. In order to efficiently change business processes, reference models as sources of to-be business processes that are to bring about economic improvements can be used. While in the past the application of reference process models would merely provide a new process model without addressing the necessary efforts of changing the technical solutions beneath it, the concept of service-oriented architecture (SOA) may significantly reduce these efforts by aligning services to business activities. The presumed ease of readily deployable business processes will then strongly promote the increased use of reference process models in business process optimization. In order to gain more insights into the potential of using reference processes in an SOA environment we carried out an analysis of a business process improvement scenario. We classified the modification operations of implementing reference processes in the scenario and propose an evaluation method for the implementation effort based on a cost model. 1
Probabilistic%2C context%2Dsensitive%2C and goal%2Doriented service selection.

Managing the Intelligent Enterprise.
No nursing home here!!! 2
VisBiz A Simplified Visualization of Business Operation.

Interactive Poster Visual Mining of Business Process Data.

Data management technology for decision support systems.

A Comprehensive and Automated Approach to Intelligent Business Processes Execution Analysis.

Mining Sequential Patterns by Pattern%2DGrowth The PrefixSpan Approach.
 Sequential pattern mining is an important data mining problem with broad applications. However, it is also a difficult problem since the mining may have to generate or examine a combinatorially explosive number of intermediate subsequences. Most of the previously developed sequential pattern mining methods, such as GSP, explore a candidate generation-and-test approach [1] to reduce the number of candidates to be examined. However, this approach may not be efficient in mining large sequence databases having numerous patterns and/or long patterns. In this paper, we propose a projection-based, sequential pattern-growth approach for efficient mining of sequential patterns. In this approach, a sequence database is recursively projected into a set of smaller projected databases, and sequential patterns are grown in each projected database by exploring only locally frequent fragments. Based on an initial study of the pattern growth-based sequential pattern mining, FreeSpan [8], we propose a more efficient method, called PSP, which offers ordered growth and reduced projected databases. To further improve the performance, a pseudoprojection technique is developed in PrefixSpan. A comprehensive performance study shows that PrefixSpan, in most cases, outperforms the a priori-based algorithm GSP, FreeSpan, and SPADE [29] (a sequential pattern mining algorithm that adopts vertical data format), and PrefixSpan integrated with pseudoprojection is the fastest among all the tested algorithms. Furthermore, this mining methodology can be extended to mining sequential patterns with user-specified constraints. The high promise of the pattern-growth approach may lead to its further extension toward efficient mining of other kinds of frequent patterns, such as frequent substructures.  
Guest Editors%27 Introduction.

Proceedings of the 19th International Conference on Data Engineering
Many web sites contain a large collection of “structured” web pages. These pages encode data from an underlying structured source, and are typically generated dynamically. An example of such a collection is the set of book pages in Amazon. There are two important characteristics of such a collection: first, all the pages in the collection contain structured data conforming to a common schema; second, the pages are generated using a common template. Our goal is to automatically extract structured data from a collection of pages described above, without any human input like manually generated rules or training sets. Extracting structured data gives us greater querying power over the data and is useful in information integration systems. Most of the existing work on extracting structured data assumes significant human input, for example, in form of training examples of the data to be extracted. To the best of our knowledge, ROADRUNNER project is the only other work that tries to automatically extract structured data. However, ROADRUNNER makes several simplifying assumptions. These assumptions and their implications are discussed in our paper [2]. Structured data denotes data conforming to a schema or type. We borrow the definition of complex types from [1]. Any value conforming to a schema is an instance of the schema. For example, the schema   ¡  £  ¥  §  ©  ¥  �  §  ¥  � represents a tuple of � attributes. The first and third attributes are “atomic”; the second attribute is a set of atomic values. The value denotes an instance of schema. A template is a pattern that describes how instances of a schema are encoded. An example template for schema above � is where each letter denotes a string. Template � encodes the first attribute of   between strings � and �, the second between �
Intelligent Management of SLAs for Composite Web Services.

Pushing the Limit in Visual Data Exploration Techniques and Applications.

Accelerated Force Computation for Physics%2DBased Information Visualization.
Visualization of similarity is an emerging technique for analyzing relation-based data sets. A common way of computing the respective layouts in an information space is to employ a physics-based mass-spring system. Force computation, however, is costly and of order N    . In this paper, we propose a new acceleration method to adopt a well-known optimized force-computation algorithm which drastically reduces the computation time to the order of N log N. The basic idea is to derive a two-pass, &#034;prediction and correction&#034; procedure including a customized potential function. We have applied this method to two different applications: web access and sales analysis. Both  demonstrate the efficiency and versatility of the presented method.
Business%2Doriented management of Web services.

Letter from the Special Issue Editors.
is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters, conference information, and news should be
3rd International Conference on Web Information Systems Engineering %28WISE 2002%29

Business Operation Intelligence.

Integrating Workflow Management Systems with Business%2Dto%2DBusiness Interaction Standard.
Business-to-Business (B2B) E-commerce is emerging as a new market with tremendous potential. Organizations are trying to link services across organizational boundaries in order to electronically trade goods and services. Standards such as RosettaNet, CBL, EDI, OBI, and cXML, describe how electronic B2B interactions should be carried on so that dynamic trade partnerships can be established and transactions can be executed across organizations. While the development of standards is a fundamental step towards enabling e-business, the problem of linking B2B interactions with internal business processes is still a challenge. In addition, as the industry standards evolve continuously based on changing needs, organizations have to adopt new standards quickly. In this paper we describe how workflow technology can be extended in order to support B2B interactions and to link them with the internal workflows. The proposed framework can be used to speed up both the development of new business processes that support B2B interaction standards and the enhancement of the existing business processes by the addition of B2B interaction capability. We demonstrate the benefits of our framework through an example in which we describe how RosettaNet Partner Interface Processes (PIPs) can be interfaced with HP Process Manager (HPPM), HP’s business process management product that was formerly known as Changengine. An analogous solution can be developed for other workflow management systems and B2B interaction standards. 1.
Business Process Cockpit.
 Business Process Cockpit (BPC) is a tool that supports real-time monitoring, analysis, management, and optimization of business processes running on top of HP Process Manager, the Business Process Management System developed by Hewlett-Packard. The main goal of the Business Process Cockpit is to enable business users to perform business-level quality analysis, monitoring, and management of business processes. The BPC visualizes process execution data according to different focus points that identify the process entities that are the focus of the analysis, and different perspectives that define a way to look at the information. The BPC also allows users to define new concepts, such as “slow” and “fast” executions, and use those concepts to categorize the viewed data and make it much easier for users to interpret.
Letter from the Special Issue Editors.
is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters, conference information, and news should be
Business Operation Intelligence Research at HP Labs.


Hierarchical Pixel Bar Charts.
Abstract. In this paper we describe DataJewel, a new architecture designed for temporal data mining. It tightly integrates a visualization component, an algorithmic component and a database component. We introduce a new visualization technique called CalendarView as an implementation of the visualization component. We show how algorithms can be tightly integrated with the visualization component and that most existing temporal data mining algorithms can be leveraged by embedding them into our architecture. This integration is achieved by an interface that is used by the user and the algorithm to assign colors to events. The user assigns colors to interactively incorporate domain knowledge or to formulate hypotheses. The algorithm assigns colors based on the discovered patterns. Using the same visualization technique for both data and patterns makes it more intuitive for the user to select useful patterns from those returned by the algorithm. We also present a data structure that supports temporal mining of very large databases. In the experiments, we apply our approach to several large datasets from the airplane maintenance domain and discuss its applicability to domains like homeland security, market basket analysis and web mining. 1
Pixel bar charts a visualization technique for very large multi%2Dattribute data sets%3F
www.palgrave-journals.com/ivs Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data presenting only a very small number of data values (as in the case of bar charts) and may have a high degree of overlap occluding a significant portion of the data values (as in the case of the x-y plots). In this article, we therefore propose a generalization of traditional bar charts and x-y-plots, which allows the visualization of large amounts of data. The basic idea is to use the pixels within the bars to present detailed information of the data records. Our so-called pixel bar charts retain the intuitiveness of traditional bar charts while allowing very large data sets to be visualized in an effective way. We show that, for an effective pixel placement, we have to solve a complex optimization problem. We then present an algorithm which efficiently solves the problem. Our application to a number of real-world e-commerce data sets shows the wide applicability and usefulness of our new idea, and a comparison to other well-known visualization techniques (parallel coordinates and spiral techniques) shows a number of clear advantages.
Multi%2DDimensional Sequential Pattern Mining.
With our recently developed sequential pattern mining algorithms, such as PrefixSpan, it is possible to mine sequential user-access patterns from Web-logs. While this information is very useful when redesigning web-sites for easier perusal and fewer network traffic bottlenecks, it would be so much richer if we could incorporate multiple dimensions of information. For example, if you knew the referral site that users frequently come from, you might be able to determine what information on your own web-site is of interest to them --- and enhance or separate this information as needed.  Similarly, if you knew what weekday and time certain access patterns frequently occur at, you could ensure updated information is ready and available for these users.  This thesis proposes and explores two different techniques, HYBRID and PSFP, to incorporate additional dimensions of information into the process of mining sequential patterns. It investigates the strengths and limitations of each approach. The HYBRID method first finds frequent dimension value combinations, and then mines sequential  patterns from the set of sequences that satisfy each of these combinations. PSFP approaches the problem from the opposite direction. It mines the sequential patterns for the whole dataset only once (using PrefixSpan), and mines the corresponding frequent dimension patterns alongside each sequential pattern (using existing association algorithm FP-growth). Experiments show that HYBRID is most effective at low support in datasets that are sparse with respect to dimension value combinations but dense with respect to the sequential patterns present. PSFP is the better alternative in every other case, including datasets that are dense with respect to both dimension values combinations and sequential ...

PrefixSpan Mining Sequential Patterns by Prefix%2DProjected Growth.

E%2DBusiness Applications for Supply Chain Automation Challenges and Solutions.

Towards an Architecture for Real%2DTime Decision Support Systems Challenges and Solutions.

Pixel Bar Charts A New Technique for Visualizing Large Multi%2DAttribute Data Sets without Aggregation.
pixel, bar chart, web transactions, visualization Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data and present only a very limited number of data values (as in the case of bar charts), and may have a high degree of overlap which may occlude a significant portion of the data values (as in the case of the x-y plots). In this paper, we therefore propose a generalization of traditional bar charts and x-y-plots which allows the visualization of large amounts of data. The basic idea is to use the pixels within the bars to present the detailed information of the data records. Our so-called pixel bar charts retain the intuitiveness of traditional bar charts while allowing very large data sets to be visualized in an effective way. We show that, for an effective pixel placement, we have to solve complex optimization problems, and present an algorithm which efficiently solves the problem. Our application using real-world e-commerce data shows the wide applicability and usefulness of our new idea.
Improving Business Process Quality through Exception Understanding
Business process automation technologies are  being increasingly used by many companies to  improve the efficiency of both internal processes  as well as of e-services offered to customers. In  order to satisfy customers and employees,  business processes need to be executed with a  high and predictable quality. In particular, it is  crucial for organizations to meet the Service  Level Agreements (SLAs) stipulated with the  customers and to foresee as early as possible the  risk of missing SLAs, in order to set the right  expectations and to allow for corrective actions.  In this paper we focus on a critical issue in  business process quality: that of analyzing,  predicting and preventing the occurrence of  exceptions, i.e., of deviations from the desired or  acceptable behavior. We characterize the  problem and propose a solution, based on data  warehousing and mining techniques. We then  describe the architecture and implementation of a  tool suite that enables exception analysis,  prediction, and prevention. Finally, we show  experimental results obtained by using the tool  suite to analyze internal HP processes.  1. 
Business Process Coordination State of the Art%2C Trends%2C and Open Issues.
Over the past decade, there has been a lot of  work in developing middleware for integrating  and automating enterprise business processes.  Today, with the growth in e-commerce and the  blurring of enterprise boundaries, there is  renewed interest in business process  coordination, especially for inter-organizational  processes. This paper provides a historical  perspective on technologies for intra- and interenterprise  business processes, reviews the state  of the art, and exposes some open research  issues. We include a discussion of process-based  coordination and event/rule-based coordination,  and corresponding products and standards  activities. We provide an overview of the rather  extensive work that has been done on advanced  transaction models for business processes, and of  the fledgling area of business process  intelligence.  1. 
Are Web Services the Next Revolution in e%2DCommerce%3F %28Panel%29.

Warehousing Workflow Data Challenges and Opportunities.
Workflow management systems (WfMSs) are  software platforms that allow the definition,  execution, monitoring, and management of  business processes. WfMSs log every event that  occurs during process execution. Therefore,  workflow logs include a significant amount of  information that can be used to analyze process  executions, understand the causes of high- and  low-quality process executions, and rate the  performance of internal resources and business  partners. In this paper we present a packaged  data warehousing solution, coupled with HP  Process Manager, for collecting and analyzing  workflow execution data. We first present the  main challenges involved in this effort, and then  detail the proposed approach.  1. 
Database Technology for Decision Support Systems.

VLDB 2000
This demonstration illustrates how a comprehensive database reconciliation tool can provide the ability to characterize data-quality and data-reconciliation issues in complex real-world applications. Telcordia&#039;s data reconciliation and data quality analysis tool includes rapid generation  of appropriate pre-processing and matching rules applied to a training set created from samples of the data. Once tuned, the appropriate rules can be applied efficiently to the complete data sets. The tool uses a modular Java-based architecture that allows for customized matching functions and iterative runs that build upon previously learned information. It has been applied to several real  database reconciliation problems. Telcordia has been able to provide significant insights to clients who recognize that they have data reconciliation problems but cannot determine root causes  effectively using currently available off-the-shelf tools. A description of the analysis of a duplicaterecord problem in a set of taxpayer databases is included in this report to illustrate the effective use of the tool.
Multi%2Dagent cooperation%2C dynamic workflow and XML for e%2Dcommerce automation.
E-Commerce is a distributed computing environment with dynamic relationships among a large number of autonomous service requesters, brokers and providers. Agents with predefined functions but without the ability to modify behavior dynamically may be too limited for mediating E-Commerce applications properly, since they cannot switch roles or adjust their behavior to participate in dynamically formed partnerships. We have developed a Java based dynamic agent infrastructure for E-Commerce automation, which supports dynamic behavior modification of agents, a significant difference from other agent platforms. Supported by dynamic agents, mechanisms have been developed for plugging in workflow and multi-agent cooperation, and for supporting dynamic workflow service provisioning that allows workflow services to be constructed on the fly. XML is chosen as our agent communication message format. Since different problem domains have different ontology, we allow agents to communicate with domain specific performatives and act using corresponding interpreters. Dynamic agents can carry, switch and exchange interpreters. Our approach enables document-driven agent cooperation and DTD based program generation, and further, allows agents to exchange and share ontology for multiple or even dynamic domains. In this way, the cooperation of dynamic agents supports plug-and-play commerce, mediating businesses that are built on one another’s services. A prototype has been developed at HP Labs.
Multi%2DAgent Cooperative Transactions for E%2DCommerce.
. E-Commerce is a distributed computing environment with dynamic  relationships among a large number of autonomous service requesters,  brokers and providers. With the increasing automation of e-commerce applications,  we will see the use of software agents that cooperate to perform business  transactions. Multi-agent cooperative transactions are different in their requirements  both from conventional atomic transactions executed under centralized  control and from nested transactions executed under hierarchical control.  Cooperative transactions require peer-to-peer protocols based on interagent  communication. In this paper, we develop a cooperative mulit-agent  transaction model that includes peer-to-peer protocols for commit control and  failure recovery. The significance and feasibility of this approach have been  demonstrated in a prototype implemented at HP Labs, using our dynamic agent  infrastructure.  1. Introduction: E-Commerce Automation  This work focuses on providing a fr...
Knowledge%2DBased Support Services Monitoring and Adaptation.

OLAP%2DBased Data Mining for Business Intelligence Applications in Telecommunications and E%2Dcommerce.

An OLAP%2Dbased Scalable Web Access Analysis Engine.
. Collecting and mining web log records (WLRs) from e-commerce  web sites has become increasingly important for targeted marketing, promotions,  and traffic analysis. In this paper, we describe a scalable data warehousing  and OLAP-based engine for analyzing WLRs. We have to address  several scalability and performance challenges in developing such a framework.  Because an active web site may generate hundreds of millions of WLRs  daily, we have to deal with huge data volumes and data flow rates. To support  fine-grained analysis, e.g., individual users&#039; access profiles, we end up with  huge, sparse data cubes defined over very large-sized dimensions (there may  be hundreds of thousands of visitors to the site and tens of thousands of  pages). While OLAP servers store sparse cubes quite efficiently, rolling up a  very large cube can take prohibitively long. We have applied several nontraditional  approaches to deal with this problem, which allow us to speed up  WLR analysis by 3 orders...
Dynamic%2DAgents%2C Workflow and XML for E%2DCommerce Automation.
. Agent technologies are now being considered for automating tasks  in e-commerce applications. However, conventional software agents with predefined  functions, but without the ability to modify behavior dynamically, may  be too limited for mediating E-Commerce applications properly, since they  cannot switch roles or adjust their behavior to participate in dynamically  formed partnerships. We have developed a Java-based dynamic agent infrastructure  for E-Commerce automation, which supports dynamic behavior modification  of agents, a significant difference from other agent platforms. Supported  by dynamic agents, mechanisms have been developed for plugging in  workflow and multi-agent cooperation, and for dynamic service provisioning,  allowing services to be constructed on the fly. We treat an agent as a Web object  with an associated URL, which makes it possible to monitor and interact  with the agent remotely via any Web browser. XML is chosen as our agent  communication message f...
A Data%2DWarehouse%2FOLAP Framework for Scalable Telecommunication Tandem Traffic Analysis.
In a telecommunication network, hundreds of millions of call detail records (CDRs) are generated daily. Applications such as tandem traffic analysis require the collection and mining of CDRs on a continuous basis. The data volumes and data flow rates pose serious scalability and performance challenges. This has motivated us to develop a scalable datawarehouse /OLAP framework, and based on this framework, tackle the issue of scaling the whole operation chain, including data cleansing, loading, maintenance, access and analysis. We introduce the notion of dynamic data warehousing for managing information at different aggregation levels with different life spans. We use OLAP servers, together with the associated multidimensional databases, as a computation platform for data caching, reduction and aggregation, in addition to data analysis. The framework supports parallel computation for scaling up data mining, and supports incremental OLAP for providing continuous data mining. A tandem traf...
FreeSpan frequent pattern%2Dprojected sequential pattern mining.
Mining frequent patterns from large databases plays an essential role in many data mining tasks and has broad applications. Most of the previously proposed methods adopt apriorilike candidate-generation-and-test approaches. However, those methods may encounter serious challenges when mining datasets with prolific patterns and/or long patterns. In this

Knowledge Management in the Service and Support Business.
As we are entering the New Millenium, we are  witnessing a global shift toward a society of  services. The evolution of the world&#039;s workforce  structure indicates clearly the magnitude and  importance of this mega-shift. The introduction  of new, exciting technologies has led to a kind of  New Economy that is based on the huge and  rapid flows of data, information and knowledge.  The Internet has had a most profound impact on  business and society, enabling the quick spread  of service industries and technologies. We  observe that cost reduction and acceleration of  business processes are the most obvious  consequences of this singular phenomenon. In  such an environment, the management of IT  support services is becoming critical for business  profitability.  1 
K%2DHarmonic Means %2D A Spatial Clustering Algorithm with Boosting.


Dynamic Data Warehousing %28abstract%29.

Visual Data Mining for Business Intelligence Applications.

VLDB Workshop on Technologies in E%2DServices %28TES%29.

A Distributed OLAP Infrastructure for E%2DCommerce.
Warehousing and mining sales transaction data to generate summary information, customer profiles, and business rules has become increasingly important in ecommerce. Such summary information and rules have to be extracted from very large collections of transaction data gathered at many distributed sites. This is challenging data mining, both in terms of the magnitude of data involved, and the need to incrementally adapt the mined patterns and rules as new data is collected. This paper describes a distributed and cooperative data warehousing, OLAP, and data mining infrastructure that addresses these challenges. Our contributions are as follows. First, we define various new classes of multidimensional and multi-level association rules (scoped multidimensional, with conjoint items, and functional) that can be extracted from customer profiles and are useful for e-commerce applications. Then, we show how customer profiles and different classes of association rules can be computed in a distri...
Dynamic Data Warehousing %28abstract%29.

OLAP%2Dbased Scalable Profiling of Customer Behavior.
Abstract. Profiling customers ’ behavior has become increasingly important for many applications such as fraud detection, targeted marketing and promotion. Customer behavior profiles are created from very large collections of transaction data. This has motivated us to develop a data-warehouse and OLAP based, scalable and flexible profiling engine. We define profiles by probability distributions, and compute them using OLAP operations on multidimensional and multilevel data cubes. Our experience has revealed the simplicity and power of OLAP-based solutions to scalable profiling and pattern analysis. 1
A Java%2DBased Visual Mining Infrastructure and Applications.

Industrial Panel on Data Warehousing Technologies Experiences

Dynamic Agents.
We claim that a dynamic agent infrastructure can provide a shift from static distributed computing to dynamic distributed computing, and we have developed an infrastructure to realize such a shift. We shall compare this infrastructure with other distributed computing infrastructures such as CORBA and DCOM, and demonstrate its
value in highly dynamic system integration, service provisioning and distributed applications such as data mining on the Web. The infrastructure is Java-based, light-weight, and extensible. It di ers from other agent platforms and client server infrastructures in its support of dynamic behavior modi cation of agents. A dynamic agent is not designed to have a xed set of prede ned functions, but instead, to carry application-specific actions, which can be loaded and modiffied on the y. This allows a dynamic
agent to adjust its capability to accommodate changes in the environment and requirements, and play different roles across multiple applications. The above features are
supported by the light-weight, built-in management facilities of dynamic agents, which can be commonly used by the carried&#034; application programs to communicate, manage
resources and modify their problem-solving capabilities. Therefore, the proposed infrastructure allows application-specific multi-agent systems to be developed easily on top
of it, provides nuts and bolts&#034; for run-time system integration, and supports dynamic service construction, modi cation and movement. A prototype has been developed at
HP Labs and made available to several external research groups.
Dynamic Software Agents for Business Intelligence Applications.
 agent infrastructure is characterized by the following.  Light-weight Management Capabilities  Each agent is provided with several light-weight management capabilities for distributed communication, program store and knowledge maintenance. These management capabilities can be used by the &#034;carried&#034; application programs to communicate and cooperate with other agents.  An object-store is maintained by the resource manager, that contains application-speci#c data #in a packet store or in an any-object store#, as well as system resources such as programs and address books. A simple concurrency control mechanism is used to support multi-threaded accesses to the application-speci#c data stores.  An agent also supports a GUI to enable userinteraction with the agent and to aid in agent application development.  Dynamic Behavior  Dynamic agents are general-purpose containers of, rather than individual and a
Management of Work in Progress in Relational Information Systems.

Dynamic%2DAgents for Dynamic Service Provisioning.
We claim that a dynamic-agent infrastructure can provide a shift from static distributed computing to dynamic distributed computing, and we have developed such an infrastructure to realize such a shift. We shall show its impact on software engineering through a comparison with other distributed object-oriented systems such as CORBA and DCOM, and demonstrate its value in highly dynamic system integration and service provisioning. The infrastructure is Java-based, light-weight, and extensible. It differs from other agent platforms and client/server infrastructures in its support of dynamic behavior modification of agents. A dynamic-agent is not designed to have a fixed set of predefined functions but instead, to carry application-specific actions, which can be loaded and modified on theory. This allows a dynamic-agent to adjust its capability for accommodating environment and requirement changes, and play different roles across multiple applications. The above features are supported by the light-weight, built-in management facilities of dynamic-agents, which can be commonly used by the &#034;carried&#034; application programs to communicate, manage resources and modify their problem solving capabilities. Therefore, the proposed infrastructure allows application-specific multi-agent systems to be developed easily on top of it, provides &#034;nuts and bolts&#034; for run-time system integration, and supports dynamic service construction, modification and movement. A prototype has been developed at HP Labs and made available to several external research groups.
An Application of Adaptive Data Mining Facilitating Web Information Access.

Data Warehousing and OLAP for Decision Support.
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic connections. Each node is ranked according to its authority with respect to the particular
Failure Handling for Transaction Hierarchies.
Multi agent systems are being used for various practical applications like e-commerce, e-auctions and gathering information from the web. Thus there is a need for these systems to be robust. However, agents can fail due to component failures. The atomic tasks taken up by the agents might also fail. So, agents need to recover to a correct state after a failure. This paper deals with the logging required and hence forth the recovery protocol to recover the agent to a correct state. An agent is modeled as a colored Petrinet. By logging the state information of the agent (Petrinet) an agent recovers from failures. For atomicity of tasks in multi-agent systems, linear two-phase commit protocol with some enhancements is proposed
Data Warehousing and OLAP for Decision Support %28Tutorial%29.
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic connections. Each node is ranked according to its authority with respect to the particular
An Overview of Data Warehousing and OLAP Technology.
Data warehousing and on-line analytical processing (OLAP) are essential elements of decision support, which has increasingly become a focus of the database industry. Many commercial products and services are now available, and all of the principal database management system vendors now have offerings in these areas. Decision support places some rather different requirements on database technology compared to traditional on-line transaction processing applications. This paper provides an overview of data warehousing and OLAP technologies, with an emphasis on their new requirements. We describe back end tools for extracting, cleaning and loading data into a data warehouse; multidimensional data models typical of OLAP; front end client tools for querying and data analysis; server extensions for efficient query processing; and tools for metadata management and for managing the warehouse. In addition to surveying the state of the art, this paper also identifies some promising research issues, some of which are related to problems that the database research community has worked on for years, but others are only just beginning to be addressed. This overview is based on a tutorial that the authors presented at the VLDB Conference, 1996. 1.
Commit Scope Control in Nested Transactions.

Database Research Lead%2C Follow%2C or Get Out of the Way%3F %2D Panel Abstract.

A Transactional Nested Process Management System.
. Workflow Management is a technique to integrate and automate the execution of steps that comprise a complex process, e:g:; a business process. Workflow Management Systems (WFMSs) primarily evolved from industry to cater to the growing demand for office automation tools among businesses. Coincidentally, database researchers developed several extended transaction models to handle similar applications. Although the goals of both the communities were the same, the issues they focused on were different. The workflow community primarily focused on modeling aspects to accurately capture the data and control flow requirements between the steps that comprise a workflow, while the database community focused on correctness aspects to ensure data consistency of sub-transactions that comprise a transaction. However, we now see a confluence of some of the ideas, with additional features being gradually offered by WFMSs. This paper provides an overview of correctness in workflow management. Correct...
Contracting Transaction Hierarchies.

The HiPAC Project
Database researchers have recognized that integrating a production rules facility into a database system provides a uniform mechanism for a number of advanced database features including integrity constraint enforcement, derived data maintenance, triggers, protection, version control, and others. In addition, a database system with rule processing capabilities provides a useful platform for large and efficient knowledge-base and expert systems. Database systems with production rules are referred to as active database systems, and the field of active database systems has indeed been active. This paper summarizes current work in active database systems and suggests future research directions. Topics covered include database rule languages, rule processing semantics, and implementation issues.  1 Introduction  Database systems provide persistent storage for massive amounts of data and powerful interfaces for querying and modifying this data. Even so, most database systems are passive, si...
Database Technology At A Crossroads.

From User Access Patterns to Dynamic Hypertext Linking.
This paper describes an approach for automatically classifying visitors of a web site according to their access patterns. User access logs are examined to discover clusters of users that exhibit similar information needs; e.g., users that access similar pages. This may result in a better understanding of how users visit the site, and lead to an improved organization of the hypertext documents for navigational convenience. More interestingly, based on what categories an individual user falls into, we can dynamically suggest links for him to navigate. In this paper, we describe the overall design of a system that implements these ideas, and elaborate on the preprocessing, clustering, and dynamic link suggestion tasks. We present some experimental results generated by analyzing the access log of a web site. Keywords:
VLDB%2795
[36] Timos Sellis, Nick Roussopoulos, and Christos Faloutsos. The R+-tree: A dynamic index for
Ten Years of Activity in Active Database Systems What Have We Accomplished%3F

From Database Programming to Business Process Programming.

Reducing Multidatabase Query Response Time by Tree Balancing.

Join Queries with External Text Sources Execution and Optimization Techniques.
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing in a system that loosely integrates an extensible database system and a text retrieval system. We focus on a class of conjunctive queries that include joins between text and structured data, in addition to selections over these two types of data. We adapt techniques from distributed query processing and introduce a novel class of join methods based on probing that is especially useful for joins with text systems, and we present a cost model for the various alternative query processing methods. Experimental results confirm the utility of these methods. The space of query plans is extended due to the additional techniques, and we describe an optimization algorithm for searching this extended space. The techniques we describe in this paper are applicable to other types of external data managers loosely integrated ...
Panel Whither TSQL3%3F

Active Database Systems.

Distributed Object Management
Thor is a new object-oriented database management system (OODBMS), intended to be used in heterogeneous distributed systems to allow programs written in different programming languages to share objects in a convenient manner. Thor objects are persistent in spite of failures, are highly likely to be accessible whenever they are needed, and can be structured to reflect the kinds of information of interest to users. Thor combines the advantages of the object-oriented approach with those of database systems: users can store and manipulate objects that capture the semantics of their applications, and can also access objects via queries. Thor is an ongoing project, and this paper is a snapshot: we describe our first design and a partial implementation of that design. This design is primarily concerned with issues related to the implementation of an OODBMS as a distributed system. 1 INTRODUCTION Distributed systems contain different kinds of computers, and users write programs in different...
The Role of Object%2DOriented Database Technology in Distributed Information Systems.

An Overview of Repository Technology.
In memory of Suzie and Walter iii
Towards an Infrastructure for Temporal Databases Report of an Invitational ARPA%2FNSF Workshop.
USC is a new stub compiler which can be used to generate stubs which perform a wide variety of data conversion operations. USC is flexible and can be used in situations were previously only manually code generation was possible. USC generated code is up to 20 times faster than code generated by traditional argument marshaling schemes such as ASN.1 and Sun XDR. This paper presents the design of USC and a comprehensive set of experiments designed to compare USC performance with the best manually generated code and traditional stub compilers. (14 pages)  TR 94-11 Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations  Vincent W. Freeh, David K. Lowenthal, and Gregory R. Andrews  A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situations, such as iterative grid computations, recursive fork/join programs, the bodies of parallel FOR loop...
Optimization of Object%2DOriented Queries Problems and Approaches.

Third Generation TP Monitors A Database Challenge.

Control of an Extensible Query Optimizer A Planning%2DBased Approach.
In this paper we address the problem of controlling the execution of a query optimizer. We describe a control for the optimization process that is based on planning. The controller described here is a goal-directed planner that intermingles planning with the execution of query transformations, and uses execution results to direct further planning of optimizer processing. We describe this control in the context of the Epoq extensible architecture. Epoq is an approach to extensible query optimization that integrates specialized rewrite strategies through its extensible control mechanism. This paper describes our planning-based approach to extensible control and illustrates it with a simple example.  1 Introduction  Optimization of a query is inherently a process of searching the space of expressions equivalent to the query. Typically, a given optimizer can only visit some portion of this space, since the set of transformation rules is usually incomplete, the cost of optimization must be ...
DBMS Research at a Crossroads The Vienna Update.
On April 23, 1993 a panel discussion was held at the IEEE International Conference on Data Engineering in Vienna, Austria, at which five members of the data base research community discussed future research topics in the DBMS area. This paper summarizes the discussion which took place. The panel followed a similar format to that used at Laguna Beach four years earlier, and four of the five panelists attended the earlier conference. As such, we contrast the recommendations of the Laguna Beach participants with those obtained four years later by a similar group.  1. INTRODUCTION  In February 1989, an informal workshop was held in Laguna Beach, California, attended by 7 senior DBMS researchers from Germany and 9 from the USA. This workshop was organized by Erich Neuhold of GMD and Michael Stonebraker of Berkeley, and sponsored by the International Computer Science Institute (ICSI). The purpose of that workshop was to discuss what DBMS topics deserve research attention in the future. Durin...
A Uniform Model for Temporal and Versioned Object%2Doriented Databases.

Issues in Operation Flow Management for Long%2DRunning Acivities.

Workshop Report International Workshop on Distributed Object Management.

A Uniform Model for Temporal Object%2DOriented Databases.
Most previoua approaches to tempoml modelling and querying have eztended the relational model with special constructs. In this paper, we start, instead, with an object-oriented data model and query language, OODAPLEX, that we had defined earlier for non-tempoml applications. We show that our approach not only provides a richer model than the relational for capturing the semantics of complex temporal objects, but also requires no special con-structs in the query language. Consequently, the retrieval of tempoml and non-temporal information is uniformly a-pressed. By allowing variables and quantifiers to range over time, we can formulate- quite naturally- queries that require special opemtors (e.g., “when”, %hift”, or modalities such as “always”) in other languages. Temporal aggregation queries, which are not easily expressed in other models, are ezpressed using the same aggregation operators as for non-temporal data. 1
An Introduction to Distributed Object Management.
This paper examines the architectural issues in building storage systems for object-oriented database management systems #OO DBMSs# and persistent languages. We survey techniques for placing small and large objects on disk and disk space management, and we present client-server architectures for OO DBMSs. We describe alternatives in making a programming language persistent and in particular, we discuss pointers and three pointer dereference mechanisms: import#export, software dereference, and hardware dereference.  1
An Activity%2FTransaction Model for a Distributed Multi%2DService System.

A Uniform Approach to Processing Temporal Queries.
dayalQcrl.dec.com Research in temporal databases has mainly focused on defining temporal data models by extending existing mod-els, and developing access structures for temporal data. Little has been done on temporal query processing and optimization. In this paper, we propose a uniform frame-work for processing temporal queries, which builds upon well-understood techniques for processing non-temporal queries. We start with an object-oriented model, and rely on its rich type system to model complex temporal infor-mation. The same query language is used to express tem-poral and non-temporal queries uniformly. A major benefit to this approach is that temporal query processing can be smoothly extended from an existing (non-temporal) query processing framework. For the purpose of query process-ing, we describe an object algebra, into which queries are compiled. Since the object algebra resembles the relational algebra, familiar relational query optimization techniques can be used. However, since the physical representation of temporal data and access methods differ from those of non-temporal data, new algorithms must be developed to evalu-ate the algebraic operators. We demonstrate that temporal queries can be processed and optimized under the existing query processing framework. 1
On Object%2DOriented Database Systems
This paper attempts to define an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented database system. We have separated these characteristics into three groups: ffl Mandatory, the ones the system must satisfy in order to be termed an objectoriented database system. These are complex objects, object identity, encapsulation, types or classes, inheritance, overriding combined with late binding, extensibility, computational completeness, persistence, secondary storage management, concurrency, recovery and an ad hoc query facility. ffl Optional, the ones that can be added to make the system better, but which are not mandatory. These are multiple inheritance, type checking and inferencing, distribution, design transactions and versions. ffl Open, the points where the designer can make a number of choices. These are the programming paradigm, the representation system, the type system, and uniformity. We...
A Transactional Model for Long%2DRunning Activities.
Many computer-supported applications are of long duration and consist of multiple steps that are exe-cuted over possibly heterogeneous servers. Such activ-ities have weaker atomicity requirements than trans-actions. Previously, we illustrated how to organize the execution of such activities using triggers and transac-tions. In this paper, we describe an execution model in.which activities may consist recursively of steps that may be subactivities or transactions. The model defines precisely the semantics of activities: commu-nication between steps and the failure semantics of activities including compensation and exception han-dling. The model also supports querying the status of activities. We also propose an implementation of the model using recoverable queues for reliably chaining the steps according to the semantics of the model. 1
Active Database Systems %28Abstract%29.
HUANG-CHENG KUO  This thesis proposes a model for database transactions to cooperate through rules, task communication and synchronization. Database transactions manipulate persistent and transient data objects. With event-conditionaction (ECA) rules from active databases, the model provides transactions with a new way of cooperation. Task communication and synchronization can be specified not only statically inside transactions, but also dynamically through rules. Statically specified task communication and synchronization cannot handle dynamic changes, which provides the motivation for using rules. A transaction manager is involved in transaction cooperation by invoking transaction manipulation operations, e.g., start a transaction as a result of an event.
Database Technologies for the 90%27s and Beyond %28Panel%29.

An Overview of PDM An Object%2DOriented Data Model.

Summary.
The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called &#034;Summary Cache&#034;; each proxy keeps a summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical -- as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30 % to 95 % of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables cache sharing among a large number of proxies.  
ADT%2Dbased Type System for SQL.

A generalized Transaction Model for Long%2DRunning Activities and Active Databases.
a quarterly bulletin of the
Organizing Long%2DRunning Activities with Triggers and Transactions.
Abstract: Business processes representing related interactions within a business organization as well as e-commerce interactions across multiple independent autonomous organizations span days and weeks in time. The software which supports or automates the activities of a single business is best modeled as a set of long running applications which interact repeatedly with the outside world. The execution of these long running applications needs to be managed and monitored because of their business value. The monitoring framework must deal with all the different requirements on long running applications: (i) multiple interactions with each autonomous business partner driven by contractual agreements, (ii) execution of multiple application steps in response to an business event (request or response from an business entity, pre-scheduled action or time-out, etc.), (iii) interaction with a specific business role (internal or external) to perform some application steps, (iv) support for extended transactional semantics (e.g., compensation framework) to accommodate activities that are long running and/or across independent business entities, and (v) finally, development and execution framework for ease of programming of business applications. Legacy application monitors (e.g., Workflow, Extended transaction monitor, Conversation monitor) are designed to satisfy specific subset of these requirements. We argue that while proposed as well as legacy long running application monitors satisfy some of these objectives, no single monitor currently supports all of these objectives. This paper discusses a design approach which could lead to a unified monitor and also shows how in the absence of a unified monitor, long running business applications can be effectively modeled and built using multiple co-operating monitors. 1.
Queries and Views in an Object%2DOriented Data Model.
December 1989.  Wuu, G.T.J., and Dayal, U. A. (1992). Uniform Model for Temporal Object-Oriented Databases. Proceedings of the Eighth International Conference on Data Engineering, Tempe, Arizona, 1992.  Klopprogge, M.R. (1981). TERM: An Approach to Include the Time Dimension in the Entity-Relationship Model. Proceedings of the Second International Conference on the Entity-Relationship Approach, pp477-512, Washington, DC, October 1981.  Lerner, B., and Habermann, A. (1990). Beyond Schema Evolution to Database Reorganisation. SIGPLANNotices 25(10):67-76, 1990.  Maier, D., and Stein, J. (1987). Development and Implementation of an ObjectOriented DBMS. In Research Directions in Object-Oriented Programming, Shriver, B., and Wegner, P. (editors), MIT Press, Cambridge, Mass.  Martin, N.G., Navathe, S.B., and Ahmed, R. (1987). Dealing with Temporal Schema Anomalies in History Databases. Proceedings of the 13th Conference on Very Large Databases, pp. 177-184, Brighton, England, Septe
Time%2DCritical Database Scheduling A Framework For Integrating Real%2DTime Scheduling and Concurrency Control.

The Architecture Of An Active Data Base Management System.
n and J. Kiernan. A declarative approach to active databases: The A-RDL language and system. In J. Widom and S. Ceri, editors, Active Database Systems: Triggers and Rules for&#039; Advanced Database Processing. Morgan-Kaufmann, Inc., San Francisco, California, 1995. to appear.  D.G. Severance and G.M. Lohman. Differential files: Their application to the maintenance of large databases. ACM Trans. on Database Systems, 1(3), September 1976.  J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, Mass., 1977.  M. Stonebraker. The integration of rule systems and database systems. IEEE Trans. on Knowledge and Data Engineering, 4(5):415 423, October 1992.  J. Widom and S. Ceri. Active Database Systems: Triggers and Rules for Advanced Database Processing. Morgan-Kaufmann, Inc., San Francisco, California, 1995.  J. Widom and S. J. Finkelstein. Set-oriented production rules in relational database systems. In Proc. ACM SIGMOD Syrup. on the
Future Directions in DBMS Research %2D The Laguna Beach Participants.

ACM TODS Publication Policy.

Active Database Management Systems.
As it is well known, business requirements are changing faster than applications can be created and/or modified. Most of these requirements are in the form of or are related to business rules. Business rules are precise statements
Rules Are Objects Too A Knowledge Model For An Active

The HiPAC Project Combining Active Databases and Timing Constraints.

Proceedings of the Association for Computing Machinery Special Interest Group on Management of Data 1987 Annual Conference

Simplifying Complex Objects The PROBE Approach to Modelling and Querying Them.

An Object%2DOriented Approach to Data Management Why Design Databases Need It.

Of Nests and Trees A Unified Approach to Processing Queries That Contain Nested Subqueries
3] A. Chen, Y. F. Kao, M. Pong, D. Sak, S. Sharma, J. Vaishnav, and H. Zeller. Query processing in NonStop SQL. IEEE Data Eng. Bull., 16(4):29, December 1993. [CLR89] T. Cormen, C. Leiserson, and R. Rivest.  Introduction to Algorithms. McGraw-Hill, New York, NY, 1989. [Cop92] J. Coplien. Advanced C++: Programming Styles and Idioms. Addison-Wesley, Reading, MA, 1992. [CS94] S. Chaudhuri and K. Shim. Including group-by in query optimization. In Proc. Intl&#039; Conf. on Very Large Data Bases, page 354, Santiago, Chile, August 1994. [Day87] U. Dayal. Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In Proc. Intl&#039; Conf. on Very Large Data Bases, page 197, Brighton, England, August 1987. [GD87] G. Graefe and D. J. DeWitt. The EXODUS optimizer generator. In Proc. ACM SIGMOD Conf., page 160, San Francisco, CA, May 1987. [GHQ95] A. 
1986 International Workshop on Object%2DOriented Database Systems
Teitelman W., Goodwin J.W., Hartley A.K., Lewis D.C., Vittal J.J., Yonke M.D., Bobrow D.G., Kaplan R.M., Masinter L.M.&amp; Sheil B.A. Interlisp Reference Manual. Xerox, Palo Alto Research Centers, California, 1978.  16.  Cardelli, L. Amber. Tech. Report AT&amp;T. Bell Labs. Murray Hill, U.S.A., 1985.  17.  The PS-algol Reference Manual fifth edition. Universities of Glasgow and St. Andrews PPRR-12, Scotland, 1988.  18.  Liskov B.H. Refinement - From Specification to Implementation, The Argus Language and System. Lecture Notes for the Advanced Course on Distributed Systems - Methods and Tools for Specification, Institute for Informatics, Technical University of Munich, 1984.  19.  Gray J., McJones P., Blasgen M., Lindsay B., Lorie R., Price T., Putzolu F. &amp; Traiger I. The Recovery Manager of the System R Database Manager. ACM Computing Surveys, vol. 13, no. 2, June 1981, pp223-242.  20.  Lorie A.L. Physical Integrity in a Large Segmented Database, ACM Transactions on Database Systems, vol.
PDM An Object%2DOriented Data Model.

Traversal Recursion A Practical Approach to Supporting Recursive Applications.

Providing Database Management Capabilities for Mission Critical Applications.

PROBE A Knowledge%2DOriented Database Management System.

Query Processing in a Multidatabase System
Cooperative Information Systems (CISs) have to manage with data located in different large information repositories distributed over communication networks. Multidatabase systems have been proposed as a solution to work with different pre-existing autonomous databases. Query processing in multidatabase systems requires a particular study because of the autonomy and heterogeneity of the component databases. In this paper we present the query processing of a multidatabase system with a global view expressed in Description Logics (DL). Query optimization techniques like semantic and caching optimization in this system are also explained. 1 Introduction Cooperative Information Systems (CISs) have to manage with data located in different large information repositories distributed over communication networks. The integration of heterogeneous and autonomous information sources is a requirement for these CISs. Multidatabase systems have been proposed as a solution to work with different pre-ex...
Tenth International Conference on Very Large Data Bases
This paper describes a study of the performance of cen-tralized concurrency control algorithms. An algorithm-independent simulation framework was developed in order to support comparative studies of various concurrency control algorithms. We describe this framework in detail and present performance results which were obtained for what we believe to be a representative cross-section of the many proposed algo-rithms. The basic algorithms studied include four lock-ing algorithms. two timestamp algorithms. and one optimistic algorithm. Also. we briefly summarize stu-dies of several multiple version algorithms and several hierarchical algorithms. We show that. in general, locking algorithms provide the best performance.
Using Semiouterjoins to Process Queries in Multidatabase Systems.

CAD%2FCAM Database Management.

View Definition and Generalization for Database Integration in a Multidatabase System.
Modern database management systems essentially solve the problem of accessing and managing large volumes of related data on a single platform, or on a cluster of tightly­coupled platforms. But many problems remain when two or more databases need to work together. A fundamental problem is raised by semantic heterogeneity -- the fact that data du­ plicated across multiple databases is represented differently in the underlying database schemas. This tutorial describes fundamental problems raised by semantic heterogeneity and surveys theoretical frameworks that can provide solutions for them. The tutorial considers the following topics: (1) repre­ sentative architectures for supporting database interoperation; (2) notions for comparing the &#034;information capacity&#034; of database schemas; (3) providing support for read­only integrated views of data, including the virtual and materialized approaches; (4) providing support for read­write integrated views of data, including the issue of workflows on heterogeneous databases; and (5) research and tools for accessing and effectively using meta­data, e.g., to identify the relationships between schemas of different databases.
Issues in Multiple Database Environmemnts %28Panel%29.

Processing Queries with Quantifiers A Horticultural Approach.

A Recovery Algorithm for a Distributed Database System.

Overview of an Ada Compatible Distributed Database Manager.

Processing Queries Over Generalization Hierarchies in a Multidatabase System.
An important task of multidatabase systems is the integration of existing databases. Data-base Integration is achieved primarily through the use of generalization. Hence, it is impor-tant to develop good tactics for processing queries over generalization hierarchies. This paper defines the class of conjunctive generali-zation queries, and it describes four tactics for processing those queries that have boon developed for the MDLTIDASE system. Since query processing tactics are best describe algebraically, the paper shows how to model generalization as a sequence of algebraic operations. Three of the tactics described here are adapted from convon-tional distributed query processing techniqaes. However, it is argued that these tactics are of limited applicability to processing queries over generalization hierarchies. A fourth tactic, semioutorjoin, which is more widely applicable. is introduced. This research was jointly supported by the De-
Supporting a Semantic Data Model in a Distributed Database System.
Existing distributed database systems are based mostly on the relational model. Further-more, it has been argued that the relational model is the model best suited for distributed databases. This paper describes an implementa-tion approach for supporting logical pointers between distributed entities. This apprdach is being employed in a distributed database system that supports a semantically rich data model and that currently is under implementation. The access structures used to support entity-to-entity pointers in this data model facilitate the maintenance of referential integrity across sites. At the same time, they provide efficient access paths for distributed query processing. To make use of these access structures the exten-sions required of existing query processing tech-niques are quite straightforward. The research reported in this paper is support-


On the Correct and Efficient Scheduling of Transactions in a Highly Parallel Database Machine.

An Extended Relational Algebra with Control over Duplicate Elimination.

Theory of Serializability for a Parallel Model of Transactions.

Query Optimization for CODASYL Database Systems.

Semantics of Network Data Manipulation Languages An Object%2DOriented Approach.

On the Correct Translation of Update Operations on Relational Views.

Research on Query Optimization at Computer Corporation of America.

On the updatability of network views%2Dextending relational view theory to the network model.

Multibase integrating heterogeneous distributed database systems.

Using the Entity%2DRelationship Model for Implementing Multi%2DModel Database Systems.

Optimal Semijoin Schedules For Query Processing in Local Distributed Database Systems.
Semijoin strategies are a technique for query processing in distributed  database systems In the past methodologies for constructing minimum  communication-cost strategies for solving tree queries have been developed  These assume point-to-point communication and ignore local processing costs  and the limited communication capacity of the system In this papers  query processing in bus or loop systems is considered The definition  of strategy is extended to allow for broadcast mode of communication We  then address the problem of finding the minimum response-time schedule  for executing a given strategy in an m-bus system taking into account  local processing and system capacity It is shown that the problem is  computationally intractable for general tree queries, even in a 1-bus  systems and for special classes of tree queries in an m-bus system However  there is a polynomial-time algorithm for simple queries in a 1-bus system 1o 
Synthesizing Independent Database Schemas.

On the Updatability of Relational Views.
This paper addresses the question of updating relational  databases through XML views. Using query  trees to capture the notions of selection, projection,  nesting, grouping, and heterogeneous sets found  throughout most XML query languages, we show  how XML views expressed using query trees can  be mapped to a set of corresponding relational  views. We then show how updates on the XML  view are mapped to updates on the corresponding  relational views. Existing work on updating relational  views can then be leveraged to determine  whether or not the relational views are updatable  with respect to the relational updates, and if so,  to translate the updates to the underlying relational  database.
